Realizability for programming languages
نویسنده
چکیده
We present a toy functional programming language inspired by our work on the PML language [22] together with a criterion ensuring safety and the fact that non termination can only occur via recursive programs. To prove this theorem, we use realizability techniques and a semantical notion of types. Important features of PML like polymorphism, proof-checking, termination criterion for recursive function, . . . will be covered by forthcoming articles reusing the formalism introduced here. The paper contains the source of the algorithm (some boring parts like the parser are omitted) and the complete source are available from the author webpage.
منابع مشابه
Matching typed and untyped realizability ( Extended abstract )
Realizability interpretations of logics are given by saying what it means for computational objects of some kind to realize logical formulae. The computational objects in question might be drawn from an untyped universe of computation, such as a partial combinatory algebra, or they might be typed objects such as terms of a PCF-style programming language. In some instances, one can show that a p...
متن کاملIndexed Realizability for Bounded-Time Programming with References and Type Fixpoints
The field of implicit complexity has recently produced several bounded-complexity programming languages. This kind of language allows to implement exactly the functions belonging to a certain complexity class. We here present a realizability semantics for a higher-order functional language based on a fragment of linear logic called LAL which characterizes the complexity class PTIME. This langua...
متن کاملRealizability and Parametricty in Pure Type Systems
We describe a systematic method to build a logic from any programming language described as a Pure Type System (PTS). The formulas of this logic express properties about programs. We define a parametricity theory about programs and a realizability theory for the logic. The logic is expressive enough to internalize both theories. Thanks to the PTS setting, we abstract most idiosyncrasies specifi...
متن کاملA Monadic Framework for Interactive Realizability
We give a new presentation of interactive realizability with a more explicit syntax. Interactive realizability is a realizability semantics that extends the Curry-Howard correspondence to (sub-)classical logic, more precisely to first-order intuitionistic arithmetic (Heyting Arithmetic) extended by the law of the excluded middle restricted to simply existential formulas, a system motivated by i...
متن کاملRealizability with constants
The proof/program correspondence has been long known to provide an interpretation of logical rules as elementary programming constructs. From λ-calculus as a formalization of cut-elimination in intuitionistic logic, the theory extended to classical logic by the introduction of global control operators [3, 6]. Extensive work has been done studying the proofs with calculus as an underlying tool, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010